Error bounds for a Deterministic
نویسندگان
چکیده
Consider the hyperbolic system of conservation laws u t + F(u) x = 0. Let u be the unique viscosity solution with initial condition u(0; x) = u(x), and let u " be an approximate solution constructed by the Glimm scheme, corresponding to the mesh sizes x, t = O((x). With a suitable choice of the sampling sequence, we prove the estimate u " (t;) ? u(t;) L 1 = o(1) p x ln((x) :
منابع مشابه
Error bounds in approximating n-time differentiable functions of self-adjoint operators in Hilbert spaces via a Taylor's type expansion
On utilizing the spectral representation of selfadjoint operators in Hilbert spaces, some error bounds in approximating $n$-time differentiable functions of selfadjoint operators in Hilbert Spaces via a Taylor's type expansion are given.
متن کاملA Novel Qualitative State Observer
The state estimation of a quantized system (Q.S.) is a challenging problem for designing feedback control and model-based fault diagnosis algorithms. The core of a Q.S. is a continuous variable system whose inputs and outputs are represented by their corresponding quantized values. This paper concerns with state estimation of a Q.S. by a qualitative observer. The presented observer in this pape...
متن کاملIntegration error for multivariate functions from anisotropic classes
The exact order of deterministic, stochastic and average error bounds of multidimensional quadrature formulas for anisotropic Sobolev class W r pðIÞ; Nikolskii class H pðIÞ and their periodic analogue is obtained. It is proved that if p41; then the stochastic and average error bounds are essentially smaller than the deterministic error bounds. Nonlinear methods, adaptive methods, or even method...
متن کاملLower Bounds for One-way Probabilistic Communication Complexity
We prove three diierent types of complexity lower bounds for the one-way unbounded-error and bounded-error error probabilistic communication protocols for boolean functions. The lower bounds are proved in terms of the deterministic communication complexity of functions and in terms of the notion \probabilistic communication characteristic" that we deene. We present boolean functions with the di...
متن کاملLower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance
Alice and Bob want to know if two strings of length n are almost equal. That is, do they differ on at most a bits? Let 0 ≤ a ≤ n − 1. We show that any deterministic protocol, as well as any error-free quantum protocol (C∗ version), for this problem requires at least n− 2 bits of communication. We show the same bounds for the problem of determining if two strings differ in exactly a bits. We als...
متن کاملLower bounds on the Deterministic and Quantum Communication Complexity of HAMna
Alice and Bob want to know if two strings of length n are almost equal. That is, do they differ on at most a bits? Let 0 ≤ a ≤ n − 1. We show that any deterministic protocol, as well as any error-free quantum protocol (C∗ version), for this problem requires at least n− 2 bits of communication. We show the same bounds for the problem of determining if two strings differ in exactly a bits. We als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998